Conditions for Occam's Razor Applicability and Noise Elimination

نویسندگان

  • Dragan Gamberger
  • Nada Lavrac
چکیده

The Occam's razor principle suggests that among all the correct hypotheses, the simplest hypothesis is the one which best captures the structure of the problem domain and has the highest prediction accuracy when classifying new instances. This principle is implicitly used also for dealing with noise, in order to avoid overrtting a noisy training set by rule truncation or by pruning of decision trees. This work gives a theoretical framework for the applicability of Occam's razor, developed into a procedure for eliminating noise from a training set. The results of empirical evaluation show the usefulness of the presented approach to noise elimination.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Learning Functions from Noise-Free and Noisy Samples via Occam's Razor

learning theory, noise, non-linear filters An Occam approximation is an algorithm that takes as input a set of samples of a function and a tolerance e, and produces as output a compact representation of a function that is within e of the given samples. We show that the existence of an Occam approximation is sufficient to guarantee the probably approximate learnability of classes of functions on...

متن کامل

Adaptive Kernels and Occam ' S Razor in Inversionproblemsr

Following the adaptive-kernel methods in density estimation theory we extend the quantiied maximum entropy concept by locally varying correlations. The smoothing property of the adaptive kernels are determined self-consistently in the framework of Bayesian probability theory with Occam's razor as driving force for the simplest model consistent with the data. The power of the adaptive-kernel app...

متن کامل

Extending Occam's Razor

Occam's Razor states that, all other things being equal, the simpler of two possible hypotheses is to be preferred. A quanti ed version of Occam's Razor has been proven for the PAC model of learning, giving sample-complexity bounds for learning using what Blumer et al. call an Occam algorithm [1]. We prove an analog of this result for Haussler's more general learning model, which encompasses le...

متن کامل

SINUSOIDS IN WHITE NOISE: A QUADRATIC PROGRAMMING APPROACH Nicolas MOAL and Jean-Jacques FUCHS

We address the problem of the estimation and identification of real sinusoids in white Gaussian noise using a correlation-based method. We estimate a partial covariance sequence from the data and seek a representation of these new observations as a superposition of a small number of cosines chosen from a redundant basis and the white noise contribution. We propose to minimize a quadratic progra...

متن کامل

Sinusoids in white noise: a quadratic programming approach

We address the problem of the estimation and identification of real sinusoids in white Gaussian noise using a correlation-based method. We estimate a partial covariance sequence from the data and seek a representation of these new observations as a superposition of a small number of cosines chosen from a redundant basis and the white noise contribution. We propose to minimize a quadratic progra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997